Distributed Theorem Proving by Peers
نویسندگان
چکیده
Peers is a prototype for parallel theorem proving in a distributed environment. It implements a number of strategies for refutational, contraction-based theorem proving in equational theories, whose signatures may include associative-commutative (AC) function symbols. “Contraction-based” strategies is a more general term for “simplification-based”, “rewriting-based” or “(Knuth-Bendix) completion-based” strategies.
منابع مشابه
Combination of Distributed Search and Multi-search in Peers-mcd.d
Peers-mcd.d implements contraction-based strategies for equational logic, modulo associativity and commutativity, with paramodulation, simplification and functional subsumption. It is a new version of Peers-mcd [4], that parallelizes McCune’s prover EQP (version 0.9d), according to the Modified Clause-Diffusion methodology (http://www.cs.uiowa.edu/∼bonacina/cd.html). In parallel search with pee...
متن کاملThe Clause-Diffusion Theorem Prover Peers-mcd (System Description)
Peers-mcd is a distributed theorem prover for equational logic with associativity and commutativity built-in. It is based on the Clause-Diffusion methodology for distributed deduction and the Argonne prover EQP. New features include ancestor-graph oriented criteria to subdivide the search among the parallel processes. Peers-mcd shows superlinear speed-up in a case study in Robbins algebra. Chal...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملSocial Network Processes in the Isabelle and Coq Theorem Proving Communities
We identify the main actors in the Isabelle and Coq communities and describe how they affect and influence their peers. This work explores selected foundations of social networking analysis that we expect to be useful in the context of the ProofPeer project, which is developing a new model for interactive theorem proving based on collaboration and social interactions.
متن کاملOn the Reconstruction of Proofs in Distributed Theorem Proving: a Modified Clause-Diffusion Method
Proof reconstruction is the operation of extracting the computed proof from the trace of a theorem-proving run. We study the problem of proof reconstruction in distributed theorem proving: because of the distributed nature of the derivation and especially because of deletions of clauses by contraction, it may happen that a deductive process generates the empty clause, but does not have all the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994